Drawing Parametric Curves Using Chebyshev Polynomials
نویسندگان
چکیده
Polynomial parametric curves are powerful and popular modeling tools in Computer Graphics and Computer Aided Design. There are two requirements that are placed on techniques for displaying these curves. In interactive applications, such as drawing and design, the need is for a fast display. In non interactive applications, such as typeset ting, the need is for accuracy (or at least the appearance of accuracy). Most techniques address one or the other of these conflicting requirements. We propose and demonstrate the use of Chebyshev basis functions for an adaptive curve drawing method which is both fast and accurate. The use of Chebyshev polynomials provide us with an inexpensive linearity measure which is useful in an recursive algorithm. Further applications of this approach include efficient boxing and the generation of smooth filtered curves.
منابع مشابه
Control point based exact description of curves and surfaces, in extended Chebyshev spaces
Extended Chebyshev spaces that also comprise the constants represent large families of functions that can be used in real-life modeling or engineering applications that also involve important (e.g. transcendental) integral or rational curves and surfaces. Concerning computer aided geometric design, the unique normalized B-bases of such vector spaces ensure optimal shape preserving properties, i...
متن کاملMultivariate polynomial interpolation on Lissajous-Chebyshev nodes
In this contribution, we study multivariate polynomial interpolation and quadrature rules on non-tensor product node sets linked to Lissajous curves and Chebyshev varieties. After classifying multivariate Lissajous curves and the interpolation nodes related to these curves, we derive a discrete orthogonality structure on these node sets. Using this discrete orthogonality structure, we can deriv...
متن کاملA simple matrix form for degree reduction of Bézier curves using Chebyshev-Bernstein basis transformations
We use the matrices of transformations between Chebyshev and Bernstein basis and the matrices of degree elevation and reduction of Chebyshev polynomials to present a simple and efficient method for r times degree elevation and optimal r times degree reduction of Bézier curves with respect to the weighted L2-norm for the interval [0,1], using the weight function wðxÞ 1⁄4 1= ffiffiffiffiffiffiffi...
متن کاملChebyshev diagrams for two-bridge knots
We show that every two-bridge knot K of crossing number N admits a polynomial parametrization x = T3(t), y = Tb(t), z = C(t) where Tk(t) are the Chebyshev polynomials and b + degC = 3N . If C(t) = Tc(t) is a Chebyshev polynomial, we call such a knot a harmonic knot. We give the classification of harmonic knots for a ≤ 3. Most results are derived from continued fractions and their matrix represe...
متن کاملSolving singular integral equations by using orthogonal polynomials
In this paper, a special technique is studied by using the orthogonal Chebyshev polynomials to get approximate solutions for singular and hyper-singular integral equations of the first kind. A singular integral equation is converted to a system of algebraic equations based on using special properties of Chebyshev series. The error bounds are also stated for the regular part of approximate solut...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015